Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
نویسندگان
چکیده
منابع مشابه
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengths on two uniform machines with given speeds 1 and s. Jobs are revealed one by one (the assignment of a job has to be done before the next job is revealed), and the objective is to minimize the makespan. In the considered variant the optimal offline makespan is known in advance. The most studied ...
متن کاملSemi-Online Scheduling on Two Uniform Machines with Known Optimum Part II: Tight Upper Bounds
We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengths on two uniform machines with given speeds 1 and s. Jobs are revealed one by one (the assignment of a job has to be done before the next job is revealed), and the objective is to minimize the makespan. In the considered variant the optimal offline makespan is known in advance. The most studied ...
متن کاملSemi-Online Scheduling on Two Uniform Machines with Known Optimum Part I: Tight Lower Bounds
This problem is about to schedule a number of jobs of different lengths on two uniform machines with given speeds 1 and s ≥ 1, so that the overall completion time, i.e., the makespan, is earliest possible. We consider a semi-online variant (introduced for equal speeds) by Azar and Regev, where the jobs arrive one after the other, while the scheduling algorithm knows the optimum value of the cor...
متن کاملTwo semi-online scheduling problems on two uniform machines
This paper considers two semi-online scheduling problems, one with known optimal value and the other with known total sum, on two uniform machines with a machine speed ratio of s ≥ 1. For the first problem, we provide an optimal algorithm for s ∈ [ 1+ √
متن کاملOptimal Preemptive Online Algorithms for Scheduling with Known Largest Size on Two Uniform Machines
In this paper, we consider the semi-online preemptive scheduling problem with known largest job sizes on two uniform machines. Our goal is to maximize the continuous period of time (starting from time zero) when both machines are busy, which is equivalent to maximizing the minimum machine completion time if idle time is not introduced. We design optimal deterministic semi-online algorithms for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central European Journal of Operations Research
سال: 2017
ISSN: 1435-246X,1613-9178
DOI: 10.1007/s10100-017-0481-z